Clique-Based Method for Social Network Clustering
نویسندگان
چکیده
منابع مشابه
Clique-based Method for Social Network Clustering
In this paper, we develop some clique-based methods for social network clustering. The quality of clustering result is measured by a novel cliquebased index, which is innovated from the modularity index proposed in [12]. We design an effective algorithm based on recursive bipartition in order to maximize the objective function of the proposed index. Noting the optimization of the objective func...
متن کاملModel-Based Method for Social Network Clustering
We propose a simple mixed membership model for social network clustering in this note. A flexible function is adopted to measure affinities among a set of entities in a social network. The model not only allows each entity in the network to possess more than one membership, but also provides accurate statistical inference about network structure. We estimate the membership parameters by using a...
متن کاملNetwork clustering via clique relaxations: A community based approach
In this paper, we present a general purpose network clustering algorithm based on a novel clique relaxation concept of k-community, which is defined as a connected subgraph such that endpoints of every edge have at least k common neighbors within the subgraph. A salient feature of this approach is that it does not use any prior information about the structure of the network. By defining a clust...
متن کاملAn Effective Method for Utility Preserving Social Network Graph Anonymization Based on Mathematical Modeling
In recent years, privacy concerns about social network graph data publishing has increased due to the widespread use of such data for research purposes. This paper addresses the problem of identity disclosure risk of a node assuming that the adversary identifies one of its immediate neighbors in the published data. The related anonymity level of a graph is formulated and a mathematical model is...
متن کاملApproximation Algorithms for Clique Clustering
A clique clustering of a graph is a partitioning of its vertices into disjoint cliques. The quality of a clique clustering is measured by the total number of edges in its cliques. We consider the online variant of the clique clustering problem, where the vertices of the input graph arrive one at a time. At each step, the newly arrived vertex forms a singleton clique, and the algorithm can merge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Classification
سال: 2019
ISSN: 0176-4268,1432-1343
DOI: 10.1007/s00357-019-9310-5